Natural Deduction for First-Order Hybrid Logic
نویسنده
چکیده
This is a companion paper to [6] where a natural deduction system for propositional hybrid logic is given. In the present paper we generalize the system to the first-order case. Our natural deduction system for first-order hybrid logic can be extended with additional inference rules corresponding to conditions on the accessibility relations and the quantifier domains expressed by so-called geometric theories. We prove soundness and completeness and we prove a normalisation theorem.
منابع مشابه
Intuitionistic hybrid logic
Hybrid logics are a principled generalization of both modal logics and description logics, a standard formalism for knowledge representation. In this paper we give the first constructive version of hybrid logic, thereby showing that it is possible to hybridize constructive modal logics. Alternative systems are discussed, but we fix on a reasonable and well-motivated version of intuitionistic hy...
متن کاملNatural Deduction for Hybrid Logic
In this paper we give a natural deduction formulation of hybrid logic. Our natural deduction system can be extended with additional inference rules corresponding to conditions on the accessibility relations expressed by so-called geometric theories. Thus, we give natural deduction systems in a uniform way for a wide class of hybrid logics which appears to be impossible in the context of ordinar...
متن کاملHigher-Order Syntax and Saturation Algorithms for Hybrid Logic
We present modal logic on the basis of the simply typed lambda calculus with a system of equational deduction. Combining first-order quantification and higher-order syntax, we can maintain modal reasoning in terms of classical logic by remarkably simple means. Such an approach has been broadly uninvestigated, even though it has notable advantages, especially in the case of Hybrid Logic. We deve...
متن کاملA Natural Deduction System for Intuitionistic Fuzzy Logic
Intuitionistic fuzzy logic IF was introduced by Takeuti and Titani. This logic coincides with the first-order Gödel logic based on the real unit interval [0, 1] as set of truth-values. We present a natural deduction system NIF for IF . NIF is defined by suitably translating a first-order extension of Avron’s hypersequent calculus for Gödel logic. Soundness, completeness and normal form theorems...
متن کاملNatural Deduction Calculus for Quantified Propositional Linear-time Temporal Logic. Technical Report
We present a natural deduction calculus for the quantified propositional linear-time temporal logic (QPTL) and prove its correctness. The system extends previous natural deduction constructions for the propositional linear-time temporal logic. These developments extend the applicability of the natural deduction to more sophisticated specifications due to the expressive power of QPTL and, on the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 14 شماره
صفحات -
تاریخ انتشار 2005